Decoding Running Key Ciphers
نویسندگان
چکیده
There has been recent interest in the problem of decoding letter substitution ciphers using techniques inspired by natural language processing. We consider a different type of classical encoding scheme known as the running key cipher, and propose a search solution using Gibbs sampling with a word language model. We evaluate our method on synthetic ciphertexts of different lengths, and find that it outperforms previous work that employs Viterbi decoding with character-based models.
منابع مشابه
Stream ciphers and the eSTREAM project
Stream ciphers are an important class of symmetric cryptographic algorithms. The eSTREAM project contributed significantly to the recent increase of activity in this field. In this paper, we present a survey of the eSTREAM project. We also review recent time/memory/data and time/memory/key trade-offs relevant for the generic attacks on stream ciphers.
متن کاملA General Encryption Scheme Based on MDS Code ( Extended Summary )
Many applications, such as wireless communications, high speed multimedia data streaming systems and sensor networks, call for strong ciphers with low computation complexity and high speed in encryption and decryption. Additive stream ciphers usually have lower computation complexity and thus provide higher encryption/decryption speed than block ciphers. An additive stream cipher usually encryp...
متن کاملOn Certain Approaches for Analysis and Design of Cryptographic Techniques for Symmetric Encryption and Key Management
This chapter yields a review of certain mathematical approaches for analysis and design of the basic cryptographic elements for establishing information security in information-communication systems. The following two topics are addressed: selected issues on stream ciphers for encryption and key management based on broadcast encryption. Certain coding related issues for security evaluation and ...
متن کاملBlock Ciphers Sensitive to Gröbner Basis Attacks
We construct and analyze Feistel and SPN ciphers that have a sound design strategy against linear and differential attacks but for which the encryption process can be described by very simple polynomial equations. For a block and key size of 128 bits, we present ciphers for which practical Gröbner basis attacks can recover the full cipher key requiring only a minimal number of plaintext/ciphert...
متن کاملCryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree
Using recent results from coding theory, it is shown how to break block ciphers operating on GF(q) where the ciphertext is express-ible as evaluations of an unknown univariate polynomial of low degree m over the plaintext with a typically low but non-negligible probability. The method employed is essentially Sudan's algorithm for decoding Reed-Solomon codes beyond the error-correction diameter....
متن کامل